A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
نویسندگان
چکیده
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was sufficient to make full logical deduction undecidable, he also proposed an alternative reasoning scheme with desirable logical properties. He also claimed (without proof) that this reasoning could be implemented efficiently using database techniques such as projections and joins. In this paper, we substantiate this claim and show how to adapt a bottom-up database query evaluation algorithm for this purpose, thus obtaining a tractability result comparable to those that exist for databases.
منابع مشابه
A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases
1 INTRODUCTION
متن کاملEvaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases
In previous work, Levesque proposed an evaluation-based reasoning procedure for socalled proper KBs, equivalent to a possibly incomplete possibly infinite set of function-free ground literals. The procedure, called V; preserved the efficiency and logical soundness of database query evaluation. Moreover, if the query was constrained to be in a special normal form, V was also logically complete. ...
متن کاملTractable Reasoning in First-Order Knowledge Bases with Disjunctive Information
This work proposes a new methodology for establishing the tractability of a reasoning service that deals with expressive first-order knowledge bases. It consists of defining a logic that is weaker than classical logic and that has two properties: first, the entailment problem can be reduced to the model checking problem for a small number of characteristic models; and second, the model checking...
متن کاملTractable First-Order Golog with Disjunctive Knowledge Bases
While based on the Situation Calculus, current implementations of the agent control language Golog typically avoid offering full first-order capabilities, but rather resort to the closed-world assumption for the sake of efficiency. On the other hand, realistic applications need to deal with incomplete world knowledge including disjunctive information. Recently Liu, Lakemeyer and Levesque propos...
متن کاملToward Efficient Default Reasoning
2 Activities and Findings Our objective was to study a novel, approximation-based, approach to tractable nonmonotonic reasoning. Despite the critical role of nonmonotonicity in most human reasoning tasks, current nonmonotonic reasoning formalisms are inherently undecidable in the general case, and are intractable in all but the most restrictive cases. To address this intractability, we combined...
متن کامل